Hierarchical Motion Estimation Algorithm Based on Pyramidal Successive Elimination

نویسندگان

  • Chia-Wen Lin
  • Yao-Jen Chang
  • Yung-Chang Chen
چکیده

In this paper, we propose a hierarchical three step search algorithm using pyramid hierarchy. Hierarchical Minkowski inequality is adopted to reduce the cost of the sum of absolute difference (SAD) computations. A top-town procedure is developed to search motion vectors hierarchically and the search pattern used in the well-known Three Step Search (TSS) is adopted. We also propose a hybrid motion estimation scheme by combining the proposed Hierarchical Block Sum Pyramid Three Step Search (HBSPTSS) with the famous Block-Based Gradient Search (BBGDS) algorithms. Experimental results show that, compared to other existing search algorithms, the proposed hybrid search algorithm can achieve high computation efficiency for both slow-motion and fast-motion video contents while maintaining excellent PSNR performance. It is thus suitable for wide application fields with real-time requirement.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extended Successive Elimination Algorithm for Fast Optimal Block Matching Motion Estimation

In this paper, we propose an extended successive elimination algorithm (SEA) for fast optimal block matching motion estimation (ME). By reinterpreting the typical sum of absolute differences measure, we can obtain additional decision criteria whether to discard the impossible candidate motion vectors. Experimental results show that the proposed algorithm reduces the computational complexity up ...

متن کامل

Advanced Multi-level Successive Elimination Algorithms Using the Locality of Pixels in Block

In this paper, we present fast algorithms to reduce the computations of block matching algorithms for motion estimation in video coding. Advanced Multi-level Successive Elimination Algorithms are based on the Multi-level Successive Elimination Algorithm. Advanced Multi-level Successive Elimination Algorithms consist of two algorithms. The first algorithm is that when we calculate the sum of abs...

متن کامل

An Optimal Fast Full Search Motion Estimation and Suboptimal Motion Estimation Algorithms

The new fast full search motion estimation algorithm for optimal motion estimation is proposed in this paper. The Fast Computing Method (FCM) which calculates the tighter boundaries faster by exploiting the computational redundancy and the Best Initial Matching Error Predictive Method (BIMEPM) which predicts the best initial matching error that enables the early rejection of highly impossible c...

متن کامل

Content-Aware Fast Motion Estimation Algorithm

In this paper, we propose the Content-Aware Fast Motion Estimation Algorithm (CAFME) that can reduce computation complexity of motion estimation (ME) in H.264/AVC while maintaining almost the same coding efficiency. Motion estimation can be divided into two phases: searching phase and matching phase. In searching phase, we propose the Simple Dynamic Search Range Algorithm (SDSR) based on video ...

متن کامل

An Efficient Motion Multiple Reference F

The H.264/AVC coding standard allows more than one decoded frame reference frames to make full use of reducing temporal redundancy in a video sequence. However, motion estimation in multiple frames introduces tremendous computational complexity. This paper presents a fast full search motion estimation algorithm for multiple reference frame motion estimation. The proposed method can be applied t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000